Introducing EURANDOM

Heavy Tailed Analysis Eurandom

Gibbsian and non-Gibbsian states at Eurandom

We review some of the work on non-Gibbsian states of the last ten years, emphasizing the developments in which Eurandom played a role.

EURANDOM PREPRINT SERIES 2011-021 Instability of MaxWeight Scheduling Algorithms

MaxWeight scheduling algorithms provide an effective mechanism for achieving queue stability and guaranteeing maximum throughput in a wide variety of scenarios. The maximumstability guarantees however rely on the fundamental premise that the system consists of a fixed set of sessions with stationary ergodic traffic processes. In the present paper we examine a scenario where the population of ac...

EURANDOM PREPRINT SERIES 2010-025 Exact FCFS matching rates for two infinite multi-type sequences

We consider an infinite sequence of items of types C = {c1, . . . , cI}, and another infinite sequence of items of types S = {s1, . . . , sJ}, and a bipartite graph G of allowable matches between the types. Matching the two sequences on a first come first served basis defines a unique infinite matching between the sequences. For (ci, sj) ∈ G we define the matching rate rci,sj as the long term f...

Diffusion Approximation for a Processor Sharing Queue in Heavy Traffic1 by H. Christian Gromoll Eurandom

Consider a single server queue with renewal arrivals and i.i.d. service times in which the server operates under a processor sharing service discipline. To describe the evolution of this system, we use a measure valued process that keeps track of the residual service times of all jobs in the system at any given time. From this measure valued process, one can recover the traditional performance ...